Completeness results for graph isomorphism
نویسندگان
چکیده
منابع مشابه
The Subgraph Bisimulation Problem
We study the complexity of the Subgraph Bisimulation Problem, which stands to Graph Bisimulation as Subgraph Isomorphism stands to Graph Isomorphism and we prove its NP-Completeness. Our analysis is motivated by its applications to Semistructured Databases.
متن کاملOn the solution of the Graph Isomorphism Problem Part 1
The presented matirial is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph’s enumeration with the help of the effective algorithms without their preliminary plotting, etc. The examining of the transformation of the vertex graphs into the edge graphs illustr...
متن کاملZero-Knowledge Proof for the Independent Set Problem
SUMMARY An efficient computational Zero-Knowledge Proof of Knowledge whose security relies on the NP-completeness of the Independent Set Problem is presented here. The proposed algorithm is constructed from a bit commitment scheme based on the hardness of the Discrete Logarithm Problem, which guarantees the fulfillment of soundness, completeness and computational zero-knowledge properties, and ...
متن کاملGraph Isomorphism is in the Low Hierarchy
The problem of determining whether two given finite graphs are isomorphic is easily seen to belong to the class NP. But up to now, no polynomial time algorithm is known. On the other hand, no NP-completeness proof is known either. That is, GRAPH ISOMORPHISM is one of the few “open problems” in NP according to Garey and Johnson’s terminology [9]. Note that GRAPH ISOMORPHISM is already mentioned ...
متن کاملGraph Isomorphism Restricted by Lists
The complexity of graph isomorphism (GraphIso) is a famous unresolved problem in theoretical computer science. For graphs G and H, it asks whether they are the same up to a relabeling. In 1981, Lubiw proved that list restricted graph isomorphism (ListIso) is NP-complete: for each u ∈ V (G), we are given a list L(u) ⊆ V (H) of possible images of u. After 35 years, we revive the study of this pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 66 شماره
صفحات -
تاریخ انتشار 2003